Optimized Implementation of Elliptic Curve Based Additive Homomorphic Encryption for Wireless Sensor Networks
نویسندگان
چکیده
When deploying wireless sensor networks (WSNs) in public environments it may become necessary to secure their data storage and transmission against possible attacks such as node-compromise and eavesdropping. The nodes feature only small computational and energy resources, thus requiring efficient algorithms. As a solution for this problem the TinyPEDS approach was proposed in [7], which utilizes the Elliptic Curve ElGamal (EC-ElGamal) cryptosystem for additive homomorphic encryption allowing concealed data aggregation. This work presents an optimized implementation of EC-ElGamal on a MicaZ mote, which is a typical sensor node platform with 8-bit processor for WSNs. Compared to the best previous result, our implementation is at least 44% faster for fixed-point multiplication. Because most parts of the algorithm are similar to standard Elliptic Curve algorithms, the results may be reused in other realizations on constrained devices as well.
منابع مشابه
Performance of Additive Homomorphic EC-ElGamal Encryption for TinyPEDS
Data aggregation is a popular approach employed in wireless sensor networks (WSNs) to minimize data transmission and storage. With aggregation techniques, the monitored data is expressed in a condensed form: Therefore, instead of storing all data sensed by several nodes, the network stores a condensed value only such as the sum of these values. However, data aggregation becomes problematic when...
متن کاملAsymmetric Homomorphic Encryption Transformation for Securing Distributed Data Storage in Wireless Sensor Networks
In asynchronous wireless sensor networks it is not possible to transmit the monitored data to an authorized recipient in real-time. Thus, the data needs to be stored within the network in distributed fashion. However, due to the resource constraints of the sensor nodes the amount of data to be stored and transmitted must be minimized. One popular technique for this is in-network data aggregatio...
متن کاملFinding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing homomorphic encryption algorithms. We make use of ElGamal encryption, Elliptic Curve encryption and a privacy homomorphism, which exhibits the property of homomorphism in our new routing protocol. Elliptic curve exhibits ...
متن کاملIntegrity protecting hierarchical concealed data aggregation for wireless sensor networks
In wireless sensor networks, performing data aggregation while preserving data confidentiality and integrity is challenging. Recently, privacy homomorphism-based secure data aggregation schemes have been proposed to seamlessly integrate confidentiality and data aggregation. However, these schemes do not provide data integrity or allow hierarchical data aggregation if more than one encryption ke...
متن کاملA New Framework for Privacy Preserving Secure Data Aggregation in Wireless Sensor Networks
In-network processing involves processing of the sensed data onthe-fly during the course of the communication to the base station. However, due to the fusion of data items sourced at different nodes into a single one, the security of the aggregated data as well as that of the aggregating node, demands critical investigation. One of the approaches to ensure secure data aggregation is to use encr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0903.3900 شماره
صفحات -
تاریخ انتشار 2007